Lecture 1 & 2 : Integer and Modular Arithmetic

Efficient recipes for performing integer arithmetic are indispensable as they are widely used in several algorithms in diverse areas such as cryptology, computer graphics and other engineering areas. Hence our first object of study would be the most basic integer operations namely addition, subtraction, multiplication and division. We will start off with algorithms that are typically referred to as “high-school” or “peasant” algorithms and move on to more efficient ones wherever scope for improvement is found.